Sequential minimaximization under dynamic programming structure
نویسندگان
چکیده
منابع مشابه
Sequential DOE via dynamic programming
The paper considers a sequential Design Of Experiments (DOE) scheme. Our objective is to maximize both information and economic measures over a feasible set of experiments. Optimal DOE strategies are developed by introducing information criteria based on measures adopted from information theory. The evolution of acquired information along various stages of experimentation is analyzed for linear...
متن کاملDynamic Programming I Parallel and Sequential Data
“An interesting question is, ’Where did the name, dynamic programming, come from?’ The 1950s were not good years for mathematical research. We had a very interesting gentleman in Washington named Wilson. He was Secretary of Defense, and he actually had a pathological fear and hatred of the word, research. I’m not using the term lightly; I’m using it precisely. His face would suffuse, he would t...
متن کاملDynamic Two-Sided Pricing under Sequential Innovation
Technology innovation engenders products of higher qualities and reduces production costs. This paper focuses on a two-sided platform tied with quality-improving hardware devices that are introduced sequentially. We analyze a monopolist’s dynamic pricing strategies facing decreasing future production cost and strategic buyers. Findings in both the traditional (buyer-side only) and two-sided bus...
متن کاملDynamic Memory Management for Sequential Logic Programming Languages
Logic programming languages are becoming more complex with the introduction of new features such as constraints or terms with an equality theory. With this increase in complexity, they require more and more sophisticated memory management. This survey gives an insight into the memory management problems in sequential logic programming language implementations ; it also describes the presently k...
متن کاملclustering.sc.dp: Optimal Clustering with Sequential Constraint by Using Dynamic Programming
The general clustering algorithms do not guarantee optimality because of the hardness of the problem. Polynomial-time methods can find the clustering corresponding to the exact optimum only in special cases. For example, the dynamic programming algorithm can solve the one-dimensional clustering problem, i.e., when the items to be clustered can be characterised by only one scalar number. Optimal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1985
ISSN: 0022-247X
DOI: 10.1016/0022-247x(85)90023-x